Attractors in complex networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximally complex simple attractors.

A relatively small number of mathematically simple maps and flows are routinely used as examples of low-dimensional chaos. These systems typically have a number of parameters that are chosen for historical or other reasons. This paper addresses the question of whether a different choice of these parameters can produce strange attractors that are significantly more chaotic (larger Lyapunov expon...

متن کامل

Learning Continuous Attractors in Recurrent Networks

One approach to invariant object recognition employs a recurrent neural network as an associative memory. In the standard depiction of the network's state space, memories of objects are stored as attractive fixed points of the dynamics. I argue for a modification of this picture: if an object has a continuous family of instantiations, it should be represented by a continuous attractor. This ide...

متن کامل

Attractors in continuous and Boolean networks.

We study the stable attractors of a class of continuous dynamical systems that may be idealized as networks of Boolean elements, with the goal of determining which Boolean attractors, if any, are good approximations of the attractors of generic continuous systems. We investigate the dynamics in simple rings and rings with one additional self-input. An analysis of switching characteristics and p...

متن کامل

Computing with dynamic attractors in neural networks.

In this paper we report on some new architectures for neural computation, motivated in part by biological considerations. One of our goals is to demonstrate that it is just as easy for a neural net to compute with arbitrary attractors--oscillatory or chaotic--as with the more usual asymptotically stable fixed points. The advantages (if any) of such architectures are currently being investigated...

متن کامل

Attractors in fully asymmetric neural networks

The statistical properties of the length of the cycles and of the weights of the attraction basins in fully asymmetric neural networks (i.e. with completely uncorrelated synapses) are computed in the framework of the annealed approximation which we previously introduced for the study of Kauffman networks. Our results show that this model behaves essentially as a Random Map possessing a reversal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chaos: An Interdisciplinary Journal of Nonlinear Science

سال: 2017

ISSN: 1054-1500,1089-7682

DOI: 10.1063/1.4996883